//
// Created by Jisam on 01/10/2024 7:28 PM.
// Solution of  b
#include <bits/stdc++.h>

#define  int long long
#define  endl "\n"
using namespace std;


signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    string s;
    cin >> s;
    int size = s.size();
    map<string,int> mp;
    int ans = 0;
    for(int i = 1; i <= n ; i ++){
        string t;
        cin >> t;
        int cnt = 0;
        if(t == s){
            cnt = size;
        }else{
            for(int j = 0 ; i < size ; i ++)
            {
                if(t[j] == s[j]){
                    cnt ++;
                }
            }
            if(cnt * 2 >= size){
                ans ++;
            }
        }
    }
    cout << ans <<endl;
    cout << (ans == 0 ?  "Good job!" :"Make persistent efforts." )<< endl;

    return 0;
}